Kripke Semantics for Basic Sequent Systems
نویسندگان
چکیده
We present a general method for providing Kripke semantics for the family of fully-structural multiple-conclusion propositional sequent systems. In particular, many well-known Kripke semantics for a variety of logics are easily obtained as special cases. This semantics is then used to obtain semantic characterizations of analytic sequent systems of this type, as well as of those admitting cut-admissibility. These characterizations serve as a uniform basis for semantic proofs of analyticity and cut-admissibility in such systems.
منابع مشابه
Minimal and Subminimal Logic of Negation
Starting from the original formulation of minimal propositional logic proposed by Johansson, this thesis aims to investigate some of its relevant subsystems. The main focus is on negation, defined as a primitive unary operator in the language. Each of the subsystems considered is defined by means of some ‘axioms of negation’: different axioms enrich the negation operator with different properti...
متن کاملModal Sequent Calculi Labelled with Truth Values: Completeness, Duality and Analyticity
Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as labels. The rules for formula constructors are common to all modal systems. For each modal system, specific rules for truth values are provided that reflect the envisaged properties of the accessibility relation. Both local and global reasoning are supported. Strong completeness is proved for a ...
متن کاملBasic Constructive Connectives, Determinism and Matrix-Based Semantics
(Non-)deterministic Kripke-style semantics is used to characterize two syntactic properties of single-conclusion canonical sequent calculi: invertibility of rules and axiom-expansion. An alternative matrixbased formulation of such semantics is introduced, which provides an algorithm for checking these properties, and also new insights into basic constructive connectives.
متن کاملOn Constructive Connectives and Systems
Canonical inference rules and canonical systems are defined in the framework of non-strict single-conclusion sequent systems, in which the succeedents of sequents can be empty. Important properties of this framework are investigated, and a general nondeterministic Kripke-style semantics is provided. This general semantics is then used to provide a constructive (and very natural), sufficient and...
متن کاملKripke-Style Semantics for Normal Systems
In this paper we describe a generalized framework of sequent calculi, called normal systems, which is suitable for a wide family of propositional logics. This family includes classical logic, several modal logics, intuitionistic logic, its dual, bi-intuitionistic logic, and various finite-valued logics. We present a general method for providing a non-deterministic finite-valued Kripke-style sem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011